Risk Minimization Framework for Multiple Instance Learning from Positive and Unlabeled Bags
نویسندگان
چکیده
Han Bao The University of Tokyo, 113-0033 Tokyo, Japan [email protected] Tomoya Sakai The University of Tokyo, 277-8561 Chiba, Japan RIKEN Center for AIP, 103-0027 Tokyo, Japan [email protected] Masashi Sugiyama RIKEN Center for AIP, 103-0027 Tokyo, Japan The University of Tokyo, 277-8561 Chiba, Japan [email protected] Issei Sato The University of Tokyo, 277-8561 Chiba, Japan RIKEN Center for AIP, 103-0027 Tokyo, Japan [email protected]
منابع مشابه
Convex Formulation of Multiple Instance Learning from Positive and Unlabeled Bags
Multiple instance learning (MIL) is a variation of traditional supervised learning problems where data (referred to as bags) are composed of sub-elements (referred to as instances) and only bag labels are available. MIL has a variety of applications such as content-based image retrieval, text categorization, and medical diagnosis. Most of the previous work for MIL assume that training bags are ...
متن کاملMultiple-Instance Active Learning
We present a framework for active learning in the multiple-instance (MI) setting. In an MI learning problem, instances are naturally organized into bags and it is the bags, instead of individual instances, that are labeled for training. MI learners assume that every instance in a bag labeled negative is actually negative, whereas at least one instance in a bag labeled positive is actually posit...
متن کاملA Framework for Multiple-Instance Learning
Multiple-instance learning is a variation on supervised learning, where the task is to learn a concept given positive and negative bags of instances. Each bag may contain many instances, but a bag is labeled positive even if only one of the instances in it falls within the concept. A bag is labeled negative only if all the instances in it are negative. We describe a new general framework, calle...
متن کاملMulti-Graph Learning with Positive and Unlabeled Bags
In this paper, we formulate a new multi-graph learning task with only positive and unlabeled bags, where labels are only available for bags but not for individual graphs inside the bag. This problem setting raises significant challenges because bag-of-graph setting does not have features to directly represent graph data, and no negative bags exits for deriving discriminative classification mode...
متن کاملRegion Selection based on Evidence Confidence for Localized Content-Based Image Retrieval
Over the past decade, multiple-instance learning (MIL) has been successfully utilized to model the localized content-based image retrieval (CBIR) problem, in which a bag corresponds to an image and an instance corresponds to a region in the image. However, existing feature representation schemes are not effective enough to describe the bags in MIL, which hinders the adaptation of sophisticated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1704.06767 شماره
صفحات -
تاریخ انتشار 2017